Uncertain Graph Sparsification
نویسندگان
چکیده
منابع مشابه
Uncertain Graph Sparsification
Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. Sparsification has often been used to reduce the size of deterministic graphs by maintaining only the important edges. However, adaptation of determi...
متن کاملUncertain Graph Processing through Representative Instances and Sparsification
Data in several applications can be represented as an uncertain graph, whose edges are labeled with a probability of existence. Currently, most query and mining tasks on uncertain graphs are based on Monte-Carlo sampling, which is rather time consuming for the large uncertain graphs commonly found in practice (e.g., social networks). To overcome the high cost, in this doctoral work we propose t...
متن کاملDistributed Graph Clustering and Sparsification
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design methods for graph clustering. Most of these methods, however, are based on complicated spectral techniques or convex optimisation, and cannot be d...
متن کاملGraph Sparsification via Refinement Sampling
A graph G(V,E) is an ǫ-sparsification of G for some ǫ > 0, if every (weighted) cut in G is within (1 ± ǫ) of the corresponding cut in G. A celebrated result of Benczúr and Karger shows that for every undirected graph G, an ǫ-sparsification with O(n log n/ǫ) edges can be constructed in O(m log n) time. The notion of cut-preserving graph sparsification has played an important role in speeding up ...
متن کاملNonlinear Graph Sparsification for SLAM
In this paper we present a novel framework for nonlinear graph sparsification in the context of simultaneous localization and mapping. Our approach is formulated as a convex minimization problem, where we select the set of nonlinear measurements that best approximate the original distribution. In contrast to previous algorithms, our method does not require a global linearization point and can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2018
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2018.2819651